Computational hardness assumptions - PDFSEARCH.IO - Document Search Engine

Computational hardness assumptions
Results: 76

#	Item
11	Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice David Adrian¶ Karthikeyan Bhargavan∗ Zakir Durumeric¶ Pierrick Gaudry† Matthew Green§ J. Alex Halderman¶ Nadia Heninger‡ Drew Springall¶ Emmanuel Add to Reading List Source URL: weakdh.org Language: English - Date: 2015-05-22 22:25:48 Finite fields Computational hardness assumptions Group theory Diffie–Hellman key exchange XTR Secure Shell Cipher suite Index calculus algorithm Elliptic curve Diffie–Hellman Cryptography Abstract algebra Cryptographic protocols
12	Formal Certification of Code-Based Cryptographic Proofs GILLES BARTHE and SANTIAGO ZANELLA BEGUELIN IMDEA Software, Madrid, Spain and BENJAMIN GREGOIRE Add to Reading List Source URL: certicrypt.gforge.inria.fr Language: English - Date: 2013-06-17 13:32:36 ElGamal encryption Public-key cryptography Ciphertext indistinguishability Diffie–Hellman problem Decisional Diffie–Hellman assumption Optimal asymmetric encryption padding Cramer–Shoup cryptosystem Cryptography Computational hardness assumptions Finite fields
13	This is a Chapter from the Handbook of Applied Cryptography, by A. Menezes, P. van Oorschot, and S. Vanstone, CRC Press, 1996. For further information, see www.cacr.math.uwaterloo.ca/hac CRC Press has granted the followi Add to Reading List Source URL: cacr.uwaterloo.ca Language: English - Date: 2011-07-10 02:35:13 FEAL Lecture Notes in Computer Science International Cryptology Conference Computational hardness assumptions Cryptographic protocols Diffie–Hellman problem Index of cryptography articles Cryptography LOKI Data Encryption Standard
14	Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡ Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2011-10-10 23:51:30 Electronic commerce Computational hardness assumptions Hidden Field Equations Pseudorandom generator RSA XTR Learning with errors Clique problem One-way function Cryptography Finite fields Public-key cryptography
15	Matrix Computational Assumptions in Multilinear Groups Paz Morillo1 , Carla R`afols2 , and Jorge L. Villar1? 1 2 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-20 07:04:42 Computational hardness assumptions Finite fields Decisional Diffie–Hellman assumption Diffie–Hellman problem Vector space Matrix Kalman filter Principal component analysis Algebra Mathematics Cryptography
16	Simplified Settings for Discrete Logarithms in Small Characteristic Finite Fields Antoine Joux CryptoExperts, Fondation UPMC, LIP6, INRIA/Ouragan Joint work with Cécile Pierrot Add to Reading List Source URL: www.iacr.org Language: English - Date: 2015-03-30 09:17:58 Logarithms Computational hardness assumptions Finite fields Modular arithmetic Discrete logarithm Index calculus algorithm Hyperelliptic curve Elliptic curve Pohlig–Hellman algorithm Abstract algebra Mathematics Group theory
17	NIST PQC Talk A Simple Provably Secure (Authenticated) Key Exchange Scheme Based on the Learning with Errors Problem Jintai Ding Add to Reading List Source URL: csrc.nist.gov Language: English - Date: 2015-04-03 13:40:14 Hellman Computational hardness assumptions Finite fields Cryptography Public-key cryptography Cryptographic protocols
18	ID-based Authenticated Two Round Multi-Party Key Agreement Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2003-12-20 20:23:11 Finite fields Computational hardness assumptions Diffie–Hellman key exchange Key-agreement protocol Diffie–Hellman problem ID-based encryption XTR Key exchange Digital signature Cryptography Cryptographic protocols Public-key cryptography
19	Main text appears in T. Okamoto (Ed.): Advances in Cryptology – ASIACRYPT 2000, Springer-Verlag LNCS 1976, pp, ISBNAddendum does not appear in proceedings. Security of Cryptosystems Based on Cl Add to Reading List Source URL: www.bmoeller.de Language: English - Date: 2006-01-02 00:24:48 Algebraic number theory Integer factorization algorithms Finite fields Computational hardness assumptions Logarithms Discrete logarithm Quadratic sieve XTR Integer factorization Abstract algebra Mathematics Algebra
20	Curriculum Vitae Yvo Desmedt 1 Personal Details Add to Reading List Source URL: www0.cs.ucl.ac.uk Language: English - Date: 2010-11-22 15:14:26 Cryptography Eurocrypt Lecture Notes in Computer Science Computational hardness assumptions